On the eigenvalues of Euclidean distance matrices
نویسنده
چکیده
In this paper, the notion of equitable partitions (EP) is used to study the eigenvalues of Euclidean distance matrices (EDMs). In particular, EP is used to obtain the characteristic polynomials of regular EDMs and non-spherical centrally symmetric EDMs. The paper also presents methods for constructing cospectral EDMs and EDMs with exactly three distinct eigenvalues. Mathematical subject classification: 51K05, 15A18, 05C50.
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملDistributions of eigenvalues of large Euclidean matrices generated from lp balls and spheres
Let x1, · · · ,xn be points randomly chosen from a set G ⊂ R and f(x) be a function. The Euclidean random matrix is given by Mn = (f(∥xi − xj∥))n×n where ∥ · ∥ is the Euclidean distance. When N is fixed and n → ∞ we prove that μ̂(Mn), the empirical distribution of the eigenvalues of Mn, converges to δ0 for a big class of functions of f(x). Assuming both N and n go to infinity proportionally, we ...
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کاملDistributions of Eigenvalues of Large Euclidean Matrices Generated from Three Manifolds
Let x1, · · · ,xn be points randomly chosen from a set G ⊂ R and f(x) be a function. A special Euclidean random matrix is given by Mn = (f(∥xi − xj∥))n×n. When p is fixed and n → ∞ we prove that μ̂(Mn), the empirical distribution of the eigenvalues of Mn, converges to δ0 for a big class of functions of f(x). Assuming both p and n go to infinity with n/p → y ∈ (0,∞), we obtain the explicit limit ...
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کامل